A GPU Implementation of a Jacobi Method for Lattice Basis Reduction

نویسندگان

  • Filip Jeremic
  • Sanzheng Qiao
چکیده

This paper describes a parallel Jacobi method for lattice basis reduction and a GPU implementation using CUDA. Our experiments have shown that the parallel implementation is more than fifty times as fast as the serial counterpart, which is about twice as fast as the well-known LLL lattice reduction algorithm.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Parallel Jacobi-type Lattice Basis Reduction Algorithm

This paper describes a parallel Jacobi method for lattice basis reduction and a GPU implementation using CUDA. Our experiments have shown that the parallel implementation is more than fifty times as fast as the serial counterpart, which is twice as fast as the well-known LLL lattice reduction algorithm.

متن کامل

A Polynomial time Jacobi Method for Lattice Basis Reduction

Among all lattice reduction algorithms, the LLL algorithm is the first and perhaps the most famous polynomial time algorithm, and it is widely used in many applications. In 2012, S. Qiao [24] introduced another algorithm, the Jacobi method, for lattice basis reduction. S. Qiao and Z. Tian [25] improved the Jacobi method further to be polynomial time but only produces a Quasi-Reduced basis. In t...

متن کامل

A Hybrid Method for Lattice Basis Reduction

Lattice reduction has a wide range of applications. In this paper, we first present a polynomial time Jacobi method for lattice basis reduction by modifying the condition for the Lagrange reduction and integrating the size reduction into the algorithm. We show that the complexity of the modified Jacobi algorithm is O(n5 logB), where n is the dimension of the lattice and B is the maximum length ...

متن کامل

Improved Lattice Basis Reduction Algorithms and their Efficient Implementation on Parallel Systems

Zusammenfassung We present the rst implementation of a full lattice basis reduction for graphics cards. Existing algorithms for lattice basis reduction on CPUs o er reasonable results concerning runtime or reduction quality but unfortunately not both at the same time. In this work, we show that the powerful architecture of graphics cards is well suited to apply alternative algorithms that were ...

متن کامل

-Implementation of lattice Boltzmann method to study mixing reduction in isothermal electroosmotic pump with hydrophobic walls

The aim of the present work is to analyze the accuracy and to extend the capability of lattice Boltzmann method in slip EOF; a phenomenon which was previously studied by molecular dynamics and less considered by LBM. At the present work, a numerical experiment on boundary conditions of slip velocity is performed and the proportionality of slip with shear stress in electroosmotic pump is proved....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013